Inductive Formulae for General Sum Operations
نویسندگان
چکیده
منابع مشابه
Heuristics for BDD handling of sum-of-products formulae
This paper presents the result of research on heuristic methods for assessment of fault-trees (boolean formulae) using Binary Decision Diagrams (BDDs for short). BDDs are the state-of-the-art compact representation of boolean formulae. The fault trees under consideration are given in the sum-of-products or products-of-sums form. We propose a new heuristic that is both robust and discriminating ...
متن کاملAlternating Sum Formulae for the Determinant and Other Link Invariants
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the determinant is the alternating sum of the number of quasi-trees of genus j of the dessin of a non-alternating link. Furthermore, we obtain formulas for coefficients of...
متن کاملA General Framework for Probabilistic Characterizing Formulae
Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae of many non-probabilistic behavioral relations. Our paper studies their techniques in a probabilistic setting. We provide a general method for determining characteristic formulae of behavioral relations for probabilistic automat...
متن کاملSome Notes on Weighted Sum Formulae for Double Zeta Values
We present a unified approach which gives completely elementary proofs of three weighted sum formulae for double zeta values. This approach also leads to new evaluations of sums relating to the harmonic numbers, the alternating double zeta values, and the Witten zeta function. We discuss a heuristic for finding or dismissing the existence of similar simple sums. We also produce some new sums fr...
متن کاملInductive Methods and Zero-sum Free Sequences
A fairly long-standing conjecture is that the Davenport constant of a group G = Zn1 ⊕ · · · ⊕ Znk with n1| . . . |nk is 1 + ∑k i=1(ni − 1). This conjecture is false in general, but it remains to know for which groups it is true. By using inductive methods we prove that for two fixed integers k and ! it is possible to decide whether the conjecture is satisfied for all groups of the form Zk ⊕ Zn ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1980
ISSN: 0025-5718
DOI: 10.2307/2006102